175 research outputs found
Distance-two coloring of sparse graphs
Consider a graph and, for each vertex , a subset
of neighbors of . A -coloring is a coloring of the
elements of so that vertices appearing together in some receive
pairwise distinct colors. An obvious lower bound for the minimum number of
colors in such a coloring is the maximum size of a set , denoted by
. In this paper we study graph classes for which there is a
function , such that for any graph and any , there is a
-coloring using at most colors. It is proved that if
such a function exists for a class , then can be taken to be a linear
function. It is also shown that such classes are precisely the classes having
bounded star chromatic number. We also investigate the list version and the
clique version of this problem, and relate the existence of functions bounding
those parameters to the recently introduced concepts of classes of bounded
expansion and nowhere-dense classes.Comment: 13 pages - revised versio
Spectrally degenerate graphs: Hereditary case
It is well known that the spectral radius of a tree whose maximum degree is D
cannot exceed 2sqrt{D-1}. Similar upper bound holds for arbitrary planar
graphs, whose spectral radius cannot exceed sqrt{8D}+10, and more generally,
for all d-degenerate graphs, where the corresponding upper bound is sqrt{4dD}.
Following this, we say that a graph G is spectrally d-degenerate if every
subgraph H of G has spectral radius at most sqrt{d.Delta(H)}. In this paper we
derive a rough converse of the above-mentioned results by proving that each
spectrally d-degenerate graph G contains a vertex whose degree is at most
4dlog_2(D/d) (if D>=2d). It is shown that the dependence on D in this upper
bound cannot be eliminated, as long as the dependence on d is subexponential.
It is also proved that the problem of deciding if a graph is spectrally
d-degenerate is co-NP-complete.Comment: Updated after reviewer comments. 14 pages, no figure
- …